NAND operation - definitie. Wat is NAND operation
Diclib.com
Woordenboek ChatGPT
Voer een woord of zin in in een taal naar keuze 👆
Taal:

Vertaling en analyse van woorden door kunstmatige intelligentie ChatGPT

Op deze pagina kunt u een gedetailleerde analyse krijgen van een woord of zin, geproduceerd met behulp van de beste kunstmatige intelligentietechnologie tot nu toe:

  • hoe het woord wordt gebruikt
  • gebruiksfrequentie
  • het wordt vaker gebruikt in mondelinge of schriftelijke toespraken
  • opties voor woordvertaling
  • Gebruiksvoorbeelden (meerdere zinnen met vertaling)
  • etymologie

Wat (wie) is NAND operation - definitie

LOGICAL OPERATION
Logical nand; Sheffer's stroke; Alternative denial; Inclusive nand; Logical NAND; Sheffer Stroke; Sheffer connective; NAND operator; Scheffers stroke; Sheffers stroke; ⊼
  • 50px
  • 50px
  • 36px
  • 36px
  • 50px
  • 50px
  • 50px
  • 50px
  • 36px
  • 50px
  • 50px
  • 50px
  • 50px
  • 50px
  • 50px
  • 50px
  • 50px
  • 50px
  • 50px
  • 50px
  • 50px
  • 50px

Sheffer stroke         
In Boolean functions and propositional calculus, the Sheffer stroke denotes a logical operation that is equivalent to the negation of the conjunction operation, expressed in ordinary language as "not both". It is also called nand ("not and") or the alternative denial, since it says in effect that at least one of its operands is false.
NAND         
WIKIMEDIA DISAMBIGUATION PAGE
NAND; Nand (disambiguation); Not-and; NAND (disambiguation)
¦ noun
1. a logical operation which gives the value zero if and only if all the operands have a value of one, and otherwise has a value of one.
2. [as modifier] Electronics denoting a gate circuit which produces an output signal unless there are signals on all of its inputs.
Origin
1950s: from not and.
NAND         
WIKIMEDIA DISAMBIGUATION PAGE
NAND; Nand (disambiguation); Not-and; NAND (disambiguation)
Not AND. The Boolean function which is true unless both its arguments are true, the logical complement of AND: A NAND B = NOT (A AND B) = (NOT A) OR (NOT B) Its truth table is: A | B | A NAND B --+---+--------- F | F | T F | T | T T | F | T T | T | F NAND, like NOR, forms a complete set of Boolean functions on its own since it can be used to make NOT, AND, OR and any other Boolean function: NOT A = A NAND A A AND B = NOT (A NAND B) A OR B = (NOT A) NAND (NOT B) (1995-01-24)

Wikipedia

Sheffer stroke

In Boolean functions and propositional calculus, the Sheffer stroke denotes a logical operation that is equivalent to the negation of the conjunction operation, expressed in ordinary language as "not both". It is also called nand ("not and") or the alternative denial, since it says in effect that at least one of its operands is false. In digital electronics, it corresponds to the NAND gate. It is named after Henry M. Sheffer and written as ↑ or as | (but not as ||, often used to represent disjunction). In Bocheński notation it can be written as Dpq.

Its dual is the NOR operator (also known as the Peirce arrow or Quine dagger). Like its dual, NAND can be used by itself, without any other logical operator, to constitute a logical formal system (making NAND functionally complete). This property makes the NAND gate crucial to modern digital electronics, including its use in computer processor design.